Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?
نویسندگان
چکیده
منابع مشابه
Résumés des cours et exposés
Heribert Vollmer : Boolean functions and Post’s lattice with applications to complexity theory. A Boolean functions f can be obtained from a set B of Boolean functions by superposition, if f can be written as a nested composition of functions from B. In the 1940’s, Emil Post determined the complete list of all sets of Boolean functions closed under superposition, and for each of them, he constr...
متن کاملBases for Boolean co-clones
The complexity of various problems in connection with Boolean constraints, like, for example, quantified Boolean constraint satisfaction, have been studied recently. Depending on what types of constraints may be used, the complexity of such problems varies. A very interesting observation of the recent past has been that the thus derived classification of constraints can be explained with the he...
متن کاملBelief propagation algorithms for constraint satisfaction problems
Belief propagation algorithms for constraint satisfaction problems by Elitza Nikolaeva Maneva Doctor of Philosophy in Computer Science and the Designated Emphasis in Communication, Computation, and Statistics University of California, Berkeley Professor Alistair Sinclair, Chair We consider applications of belief propagation algorithms to Boolean constraint satisfaction problems (CSPs), such as ...
متن کاملFunctional clones and expressibility of partition functions
We study functional clones, which are sets of non-negative pseudo-Boolean functions closed under (essentially) multiplication, summation and limits. Functional clones naturally form a lattice under set inclusion and are closely related to counting Constraint Satisfaction Problems (CSPs). We identify a sublattice of interesting functional clones and investigate the relationships and properties o...
متن کاملRelating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis
Obtaining lower bounds for NP-hard problems has for a long time been an active area of research. Recent algebraic techniques introduced by Jonsson et al. (SODA 2013) show that the time complexity of the parameterized SAT(·) problem correlates to the lattice of strong partial clones. With this ordering they isolated a relation R such that SAT(R) can be solved at least as fast as any other NP-har...
متن کامل